A sublinear parallel algorithm for stable matching
نویسندگان
چکیده
منابع مشابه
A Parallel Iterative Improvement Stable Matching Algorithm
In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem as an optimization problem with all possible matchings forming its solution space. Since a stable matching always exists for any stable matching problem instance, finding a stable matching is equivalent to finding a matching wit...
متن کاملA Sublinear-Time Parallel Algorithm for Integer Modular Exponentiation
The modular exponentiation problem is, given integers x; a; m with m > 0, compute x a mod m. Let n denote the sum of the lengths of x, a, and m in binary. We present a parallel algorithm for this problem that takes O(n= log log n) time on the common CRCW PRAM using O(n 2+) processors. This algorithm is based on Bernstein's Explicit Chinese Remainder Theorem combined with a fast method for paral...
متن کاملA Sublinear Time Parallel GCD Algorithm for the EREW PRAM
We present a parallel algorithm that computes the greatest common divisor of two integers of n bits in length that takes O(n log logn/ logn) expected time using n processors on the EREW PRAM parallel model of computation. We believe this to be the first sublinear time algorithm on the EREW PRAM for this problem.
متن کاملSublinear-Time Parallel Algorithms for Matching and Related Problems
This paper presents the first sublinear-time deterministic parallel algorithms fix bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. Our results are based on a better understanding of the combinatorial structure of the above problems, which leads to new algorithmic techniques. In particular, we show how to...
متن کاملA Fast Algorithm for Confidently Stable Matching
An efficient O(d2n) algorithm for confidently stable matching for general inhibition zones and an O(dn log n) algorithm for X-zones are proposed and proved, where n is matching table size and d is inhibition zone depth.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00125-5